Reachability sets of parameterized rings as regular languages
نویسندگان
چکیده
We present here a method for deriving a regular language that characterizes the set of reachable states of a given parametrized ring (made of N of identical components). The method basically proceeds in two steps: rst one generates a regular language L by inductive inference from a nite sample of reachable states; second one formally checks that L characterizes the whole set of reachable states.
منابع مشابه
Regular Model Checking Using Inference of Regular Languages
Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems...
متن کاملRegular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
In this paper, we study boolean (not necessarily positive) combinations of open sets. In other words, we study positive boolean combinations of safety and reachability conditions. We give an algorithm, which inputs a regular language of infinite trees, and decides if the language is a boolean combination of open sets.
متن کاملA Divide-and-Conquer Strategy for Regular Model Checking
Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, integers, ...
متن کاملProving Reachability Properties on Term Rewriting Systems with Strategies
We aim at defining regular over-approximation of sets of reachable terms for term rewriting systems applied with a strategy. In this ongoing work, we focus on innermost strategies which are the evaluation strategy of most functional programming languages. Having an accurate over-approximation of reachable terms for functional programming languages would permit to prove richer unreachability pro...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 9 شماره
صفحات -
تاریخ انتشار 1997